Topics in Graph Theory
نویسنده
چکیده
Abstract. This paper is an exposition of some classic results in graph theory and their applications. A proof of Tutte’s theorem is given, which is then used to derive Hall’s marriage theorem for bipartite graphs. Some compelling applications of Hall’s theorem are provided as well. In the final section we present a detailed proof of Menger’s theorem and demonstrate its power by deriving König’s theorem as an immediate corollary.
منابع مشابه
Selected Topics in the Extremal Graph Theory
Extremal problems in graph theory form a very wide research area. We study the following topics: the metric dimension of circulant graphs, the Wiener index of trees of given diameter, and the degree‐diameter problem for Cayley graphs. All three topics are connected to the study of distances in graphs. We give a short survey on the topics and present several new results.
متن کاملExact annihilating-ideal graph of commutative rings
The rings considered in this article are commutative rings with identity $1neq 0$. The aim of this article is to define and study the exact annihilating-ideal graph of commutative rings. We discuss the interplay between the ring-theoretic properties of a ring and graph-theoretic properties of exact annihilating-ideal graph of the ring.
متن کاملA graph associated to spectrum of a commutative ring
Let $R$ be a commutative ring. In this paper, by using algebraic properties of $R$, we study the Hase digraph of prime ideals of $R$.
متن کاملSome Fixed Point Results on Intuitionistic Fuzzy Metric Spaces with a Graph
In 2006, Espinola and Kirk made a useful contribution on combining fixed point theoryand graph theory. Recently, Reich and Zaslavski studied a new inexact iterative scheme for fixed points of contractive and nonexpansive multifunctions. In this paper, by using the main idea of their work and the idea of combining fixed point theory on intuitionistic fuzzy metric spaces and graph theory, ...
متن کاملSolving a nurse rostering problem considering nurses preferences by graph theory approach
Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...
متن کاملTHE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G
To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin V}$ and two vertices ${x,y},{z,w}in G_{triangle,square}$ are adjacent if and only if ${x,z},{x,w},{y,z},{y,w}in Vcup E$. The graph $G_{triangle,square}$ is called the $(triangle,square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the ...
متن کامل